compute bound

См. также в других словарях:

• CPU bound — In computer science, CPU bound (or compute bound) is when the time for a computer to complete a task is determined principally by the speed of the central processor: processor utilization is high, perhaps at 100% usage for many seconds or minutes …   Wikipedia

• Memory bound function — Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of available memory to hold data. In other words, the limiting factor of solving a given problem is the memory… …   Wikipedia

• Chernoff bound — In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… …   Wikipedia

• Chapman–Robbins bound — In statistics, the Chapman–Robbins bound or Hammersley–Chapman–Robbins bound is a lower bound on the variance of estimators of a deterministic parameter. It is a generalization of the Cramér–Rao bound; compared to the Cramér–Rao bound, it is both …   Wikipedia

• Data Intensive Computing — is a class of parallel computing applications which use a data parallel approach to processing large volumes of data typically terabytes or petabytes in size and typically referred to as Big Data. Computing applications which devote most of their …   Wikipedia

• Supercomputer — A supercomputer is a computer that is at the frontline of processing capacity, particularly speed of calculation (at the time of its introduction). The term Super Computing was first used by New York World newspaper in 1929 [cite book |last=Eames …   Wikipedia

• Flexible Architecture for Simulation and Testing — The FAST Project is a new hybrid hardware prototyping platform enabled by integrating a variety of hardware components on a printed circuit board (PCB) to implement Chip Multiprocessor (CMP) or Multiprocessor (MP) systems. The Flexible… …   Wikipedia

• Ken Batcher — is a professor of Computer Science at Kent State University. He also worked as a computer architect at Goodyear Aerospace in Akron, Ohio for 28 years. He received his Ph.D. from the University of Illinois in 1969.Among the designs he worked on at …   Wikipedia

• Seccomp — is a simple sandboxing mechanism for the Linux kernel.It allows a process to make a one way transition into a secure state where it cannot make any system calls except exit(), read() and write() to already open file descriptors. Should it attempt …   Wikipedia

• Three-Level-Scheduling — (TLS) TLS unterteilt den Scheduling Prozess in 3 Teilprozesse: Admission Scheduler Memory Scheduler CPU Scheduler Three Level Scheduling Am Beginn dieses Schedulingverfahrens steht ein Input Queue. Dabei handelt es sich lediglich um eine… …   Deutsch Wikipedia

• MUSIC/SP — Infobox OS name = MUSIC/SP caption = Example of initial login screen for MUSIC/SP developer = McGill University source model = kernel type = supported platforms = S/360, S/370, and 4300 series mainframes ui = family = released = late 1960s latest …   Wikipedia